Identical Parallel Machines Vs . Unit - Time Shops , Preemptions Vs . Chains , and Other Offsets in Scheduling
نویسندگان
چکیده
This paper studies the complexity variations of scheduling problems in diierent machine environments when replacing operations with arbitrary processing times by the chains of operations with unit processing times. Special attention is paid to polynomial-time algorithms for chain-like precedence-constrained problems with unit processing times and transformations of their solutions to each other. Due to the small size, the problems of this type cannot be solved in polynomial time by the algorithms solving in polynomial time their extensions with tree-like or general precedence constraints. There are also considered reductions of preemptive problems with arbitrary processing times to nonpreemptive problems with unit processing times in cross or equal machine environments involving parallel machines, a ow shop and an open shop. The complexity status of several problems that were open before is clariied.
منابع مشابه
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
متن کامل
Finite Horizon Economic Lot and Delivery Scheduling Problem: Flexible Flow Lines with Unrelated Parallel Machines and Sequence Dependent Setups
This paper considers the economic lot and delivery scheduling problem in a two-echelon supply chains, where a single supplier produces multiple components on a flexible flow line (FFL) and delivers them directly to an assembly facility (AF). The objective is to determine a cyclic schedule that minimizes the sum of transportation, setup and inventory holding costs per unit time without shortage....
متن کاملMulti-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملEconomic Lot Sizing and Scheduling in Distributed Permutation Flow Shops
This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...
متن کاملModeling and scheduling no-idle hybrid flow shop problems
Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998